Network optimization: Algorithms and applicationsGALLO, Giorgio; GRIGORIADIS, Michael D.Mathematical programming. 1997, Vol 78, Num 2, issn 0025-5610, 200 p.Conference Proceedings

A branch-and-cut algorithm for the equicut problemBRUNETTA, L; CONFORTI, M; RINALDI, G et al.Mathematical programming. 1997, Vol 78, Num 2, pp 243-263, issn 0025-5610Conference Paper

Minimum-perimeter domain assignmentYACKEL, J; MEYER, R. R; CHRISTOU, I et al.Mathematical programming. 1997, Vol 78, Num 2, pp 283-303, issn 0025-5610Conference Paper

Multiflows and disjoint paths of minimum total costsKARZANOV, A. V.Mathematical programming. 1997, Vol 78, Num 2, pp 219-242, issn 0025-5610Conference Paper

A new pivot selection rule for the network simplex algorithmSOKKALINGAM, P. T; SHARMA, P; AHUJA, R. K et al.Mathematical programming. 1997, Vol 78, Num 2, pp 149-158, issn 0025-5610Conference Paper

Dynamic trees as search trees via Euler tours, applied to the network simplex algorithmTARJAN, R. E.Mathematical programming. 1997, Vol 78, Num 2, pp 169-177, issn 0025-5610Conference Paper

A new strongly polynomial dual network simplex algorithmARMSTRONG, R. D; JIN, Z.Mathematical programming. 1997, Vol 78, Num 2, pp 131-148, issn 0025-5610Conference Paper

A polynomial time primal network simplex algorithm for minimum cost flowsORLIN, J. B.Mathematical programming. 1997, Vol 78, Num 2, pp 109-129, issn 0025-5610Conference Paper